Introspective pushdown analysis of higher-order programs
نویسندگان
چکیده
منابع مشابه
Pushdown Control-Flow Analysis of Higher-Order Programs
Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites— a property that eliminates spurious interprocedural paths. Vardoulakis and Shivers’s recent formulation of CFA2 showed that it is possible (if expensive) to apply context-free methods to higherorder languages and gain the same boost in precision achieved over first-or...
متن کاملIntrospective pushdown analysis
In the static analysis of functional programs, pushdown flow analysis and abstract garbage collection skirt just inside the boundaries of soundness and decidability. This work illuminates and conquers the theoretical challenges that stand in the way of combining the power of these techniques. Pushdown flow analysis grants unbounded yet computable polyvariance to the analysis of return-flow in h...
متن کاملRegular Sets of Higher-Order Pushdown Stacks
It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pushdown automata and investigate, with a particular stress on effectiveness and complexity, the natural notion of regularity for higher-order stacks: a set of level k stacks is regular if it is obtained by a regular sequence of ...
متن کاملSymbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use ofhigher-order stacks, that is, a nested “stack of stacks” structure. These systems may be usedto model higher-order programs and are closely related to the Caucal hierarchy of infinitegraphs and safe higher-order recursion schemes.We consider the backwards-reachability problem over higher-order Alt...
متن کاملTermination analysis of higher-order functional programs
This thesis concerns fully automatic termination analysis for higher-order purely functional programs, both strict and lazy. We build on existing work on size-change termination, in which a program is deemed to terminate if any potential infinite sequence of calls would result in infinite descent in a well-founded data value. This was proposed for strict firstorder programs, and a termination a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2012
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2398856.2364576